Motivating lazy guards
نویسندگان
چکیده
منابع مشابه
The Discrete Time Behavior of Lazy Linear Hybrid Automata
We study the class of lazy linear hybrid automata with finite precision. The key features of this class are: – The observation of the continuous state and the rate changes associated with mode switchings take place with bounded delays. – The values of the continuous variables can be observed with only finite precision. – The guards controlling the transitions of the automaton are finite conjunc...
متن کاملFine Control of Demand in Haskell
Functional languages have the -calculus at their core, but then depart from this rm foundation by including features that alter their default evaluation order. The resulting mixed evaluation|partly lazy and partly strict|complicates the formal semantics of these languages. The functional language Haskell is such a language, with features such as pattern-matching, case expressions with guards, e...
متن کاملReal-Time Persistent Queues and Deques with Logic Variables (Declarative Pearl)
We present a Prolog implementation of real-time persistent queues and double-ended queues. Our implementation is inspired by Okasaki’s lazy-functional approach, but relies only on standard Prolog, comprising of the pure subset plus if-then-else constructs to efficiently implement guards and meta-calls for convenience. The resulting data structure is a nice demonstration of the fact that the use...
متن کاملLazyJ: Seamless Lazy Evaluation in Java
LazyJ is a backward-compatible extension of the Java programming language that allows programmers to seamlessly tap into the power and expressiveness of lazy evaluation. It does so by extending Java’s type system with lazy types. A variable of type lazy T (where T is any Java type) can hold a thunk which when evaluated will yield a value of type T. The existence of coercions between non-lazy an...
متن کاملSymbolic Reachability Analysis of Lazy Linear Hybrid Automata
Lazy linear hybrid automata (LLHA) model the discrete time behavior of control systems containing finite-precision sensors and actuators interacting with their environment under bounded inertial delays. In this paper, we present a symbolic technique for reachability analysis of lazy linear hybrid automata. The model permits invariants and guards to be nonlinear predicates but requires flow valu...
متن کامل